#include <iostream>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>

using namespace std;
const int N=25;
int v[N];
bool solve(int index,int n){
    if(index==0){
        return v[0]==n;
    }else if(v[index]>n){
        return solve(index-1,n);
    }else{
        bool a=solve(index-1,n-v[index]);
        bool b=solve(index-1,n);
        return a||b;
    }
}
int main(){
    int t,n;
    cin >> t;
    while(t--){
        cin >>n;
        memset(v,0,sizeof(v));
        int sum=0;
        for(int i=0;i<n;i++){
            cin >> v[i];
            sum+=v[i];
        }
        int f=1;
        for(int i=1;i<=n;i++){
            if(!solve(i-1,i)){
               f=0;
               break;
            }
        }
        if(f){
            cout << "Yes" <<endl;
        }else{
            cout << "No" <<endl;
        }
    }
    return 0;
}